A Compiler for Constraint Handling Rules based onPartial

We argue to base the compilation of a particular language for writing constraint solvers, CHR, on partial evaluation (PE). In contrast to previous compilers realizations the semantics of the generated code are easier to prove to correspond to the intended ones and we can capitalize on the possibility to control the degree of PE, which allows for everything between interpreted execution to full compilation. The resulting diierences in execution speed and code size are subject to a tradeoo made and controlled by the user through compiler opotions. Further, PE based compilation prepares a next step in the evolution of CHR implementations where the realization of parts of the constraint store will be made available to the PE process. The specialization of the abstract data types that make up the constraint store is instrumental in narrowing the performance gap between special purpose constraint solvers and CHR.